The ULT-HSS hybrid iteration method for symmetric saddle point problems
نویسندگان
چکیده
منابع مشابه
Regularized HSS Iteration Method for Saddle - Point Linear Systems
We propose a class of regularized Hermitian and skew-Hermitian splitting methods for the solution of large, sparse linear systems in saddle-point form. These methods can be used as stationary iterative solvers or as preconditioners for Krylov subspace methods. We establish unconditional convergence of the stationary iterations and we examine the spectral properties of the corresponding precondi...
متن کاملPreconditioned Hss-like Iterative Method for Saddle Point Problems
A new HSS-like iterative method is first proposed based on HSS-like splitting of nonHermitian (1,1) block for solving saddle point problems. The convergence analysis for the new method is given. Meanwhile, we consider the solution of saddle point systems by preconditioned Krylov subspace method and discuss some spectral properties of the preconditioned saddle point matrices. Numerical experimen...
متن کاملRegularized HSS iteration methods for saddle-point linear systems
We propose a class of regularized Hermitian and skew-Hermitian splitting methods for the solution of large, sparse linear systems in saddle-point form. These methods can be used as stationary iterative solvers or as preconditioners for Krylov subspacemethods.We establish unconditional convergence of the stationary iterations and we examine the spectral properties of the corresponding preconditi...
متن کاملOn generalized SSOR-like iteration method for saddle point problems
In this paper, we study the iterative algorithms for saddle point problems(SPP). We present a new symmetric successive over-relaxation method with three parameters, which is the extension of the SSOR iteration method. Under some suitable conditions, we give the convergence results. Numerical examples further confirm the correctness of the theory and the effectiveness of the method. Key–Words: i...
متن کاملGeneral constraint preconditioning iteration method for singular saddle-point problems
For the singular saddle-point problems with nonsymmetric positive definite (1, 1) block, we present a general constraint preconditioning (GCP) iteration method based on a singular constraint preconditioner. Using the properties of the Moore-Penrose inverse, the convergence properties of the GCP iteration method are studied. In particular, for each of the two different choices of the (1, 1) bloc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Thermal Science
سال: 2021
ISSN: 0354-9836,2334-7163
DOI: 10.2298/tsci200115128l